Spectral Lower Bounds for the Quantum Chromatic Number of a Graph – Part II
نویسندگان
چکیده
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملUpper bounds for the chromatic number of a graph
For a connected graph G of order n, the clique number ω(G), the chromatic number χ(G) and the independence number α(G) satisfy ω(G) ≤ χ(G) ≤ n − α(G) + 1. We will show that the arithmetic mean of the previous lower and upper bound provides a new upper bound for the chromatic number of a graph.
متن کاملSpectral Bounds on the Chromatic Number
The purpose of this paper is to discuss spectral bounds on the chromatic number of a graph. The classic result by Hoffman, where λ1 and λn are respectively the maximum and minimum eigenvalues of the adjacency matrix of a graph G, is χ(G) ≥ 1− λ1 λn . It is possible to discuss the coloring of Hermitian matrices in general. Nikiforov developed a spectral bound on the chromatic number of such matr...
متن کاملUnified spectral bounds on the chromatic number
One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn. We recently generalised this bound to include all eigenvalues of the adjacency matrix. In this paper, we further generalize these results to include all eigenva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9295